Analytical results for the distribution of cover times of random walks on random regular graphs
نویسندگان
چکیده
Abstract We present analytical results for the distribution of cover times random walks (RWs) on regular graphs consisting N nodes degree c ( ⩾ 3). Starting from a initial node at time t = 1, each step 2 an RW hops into neighbor its previous node. In some steps may visit new, yet-unvisited node, while in other it revisit that has already been visited before. The T C is number required to every single network least once. derive master equation P S s ) distinct by up and solve analytically. Inserting we obtain cumulative times, namely probability ⩽ will all network. Taking large limit, show converges Gumbel distribution. calculate partial (PC) PC, k ), which complete visiting nodes. also (RC) RC, subgraph randomly pre-selected distributions are found be very good agreement with obtained computer simulations.
منابع مشابه
Cover Times of Random Walks on Finite Graphs
The cover time of a random walk on a finite graph is defined to be the number of steps it takes to hit all the vertices of the graph. For our senior integrative exercise in the Department of Mathematics at Carleton College, we investigated the problem of finding whatever information we could (expectation, variance, or exact distribution) about the cover times for random walks on certain types o...
متن کاملThe cover times of random walks on random uniform hypergraphs
Random walks in graphs have been applied to various network exploration and network maintenance problems. In some applications, however, it may be more natural, and more accurate, to model the underlying network not as a graph but as a hypergraph, and solutions based on random walks require a notion of random walks in hypergraphs. At each step, a random walk on a hypergraph moves from its curre...
متن کاملMeeting Times of Random Walks on Graphs
We prove an upper bound on the meeting time of an arbitrary number of random walks in any connected undirected graph in terms of the meeting times of fewer random walks. We show that the bound is tight for rings, and that it is both stronger and more general than a bound suggested by Tetali and Winkler [4].
متن کاملMixing Times for Random Walks on Geometric Random Graphs
A geometric random graph, G(n, r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each other. The G(n, r) has been of great interest due to its success as a model for ad-hoc wireless networks. It is well known that the connectivity of G(n, r) exhibits a threshold property: there exists a...
متن کاملMultiple Random Walks in Random Regular Graphs
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is asymptotic to θrn lnn, where θr = (r − 1)/(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A
سال: 2021
ISSN: ['1751-8113', '1751-8121']
DOI: https://doi.org/10.1088/1751-8121/ac3a34